On a Product Network of Enhanced Wrap-Around Butterfly and de Bruijn Networks

نویسندگان

  • Osman Guzide
  • Weidong Liao
چکیده

The topological structures of conventional Interconnection networks, such as Mesh, have recently been adopted in emerging areas such as wireless sensor networks, the pervasive computing and the Internet of Things. In this paper, we propose and analyze a novel Interconnection network topology called Enhanced Butterfly-de-Bruijn (denoted as EBnDn), which is the Product of Enhanced wrap-around Butterfly (denoted as EBn) and de Bruijn Networks (Dn). We show that this Interconnection network may provide connections among n2 n 2 n nodes with a diameter of n, same as enhanced butterfly network, and a constant node degree of 11. Other desirable properties of our proposed product network as analyzed in this paper are 1): EBnDn is symmetric, even though it is a product of symmetric and non-symmetric networks; 2): EBnDn contains 2 n distinct copies of EBn (enhanced wrap-around Butterfly Network; 3): EBnDn supports all cycle subgraphs. The proposed network topology structure may potentially be employed in parallel and distributed systems, as well as wireless sensor networks and the Internet of Things (IOT) environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological and Structural Properties of Butterfly-de-Bruin: A Product Network of Wrap-Around Butterfly and de Bruin Networks

This paper proposes and analyzes a novel interconnection network called Butterfly-de-Bruijn, which is a Product of wrap-around Butterfly and de Bruijn Networks. This new network, as a product of Butterfly (Bn) and de Bruijn (Dn) networks of degree n and denoted as BnDn, provides the connection among n2 2 nodes with a diameter of |_3n/2_|, same as butterfly network, and a constant node degree of...

متن کامل

Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"

Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed.

متن کامل

Embedding Complete Binary Trees into Butterfly Networks

In this paper we present embeddings of complete binary trees into butterfly networks with or without wrap-around connections. Let m be an even integer and q = m+ LlogmJ-l. We show how to embed a 2+I -I-node complete binary tree T(q) into a (m + 1)2111+1_ node wrap-around butterfly B1l1(m +1) with a dilation of 4, and how to embed T(q) into a (m + 2)2+_node wrap-around butterfly B 1l1 (m +2) wit...

متن کامل

Enhanced butterfly: A cayley graph with node degree 5

We describe a new interconnection network called the Enhanced Butterfly (EBn). It is a Cayley graph with n2 nodes, each incident with five edges. This new network has a diameter n which compares favorably to the wrap-around butterfly (Bn) with the same number of nodes and a diameter of b3n/2c. Bn is a subgraph of EBn. The simple and optimal routing algorithms for this network are presented.

متن کامل

De Bruijn digraphs and affine transformations

Let Zd be the additive group of 1×n row vectors over Zd. For an n×nmatrix T over Zd and ω ∈ Z n d , the affine transformation FT,ω of Z n d sends x to xT +ω. Let 〈α〉 be the cyclic group generated by a vector α ∈ Zd . The affine transformation coset pseudo-digraph TCP (Zd , α, FT,ω) has the set of cosets of 〈α〉 in Z n d as vertices and there are c arcs from x+ 〈α〉 to y+ 〈α〉 if and only if the nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017